How to Play Unique Games on Expanders
نویسندگان
چکیده
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1−ε)-satisfiable instance of Unique Games with the constraint graph G, our algorithm finds an assignment satisfying at least a 1 − Cε/hG fraction of all constraints if ε < cλG where hG is the edge expansion of G, λG is the second smallest eigenvalue of the Laplacian of G, and C and c are some absolute constants.
منابع مشابه
بازی‌های جدی در آموزش پزشکی: چرایی، چیستی، چگونگی
Introduction: Use of appropriate teaching-learning strategies play a unique role in improving the learning process of medical students. This research aims to investigate what, why and how serious games affect teaching methods. Methods: This review paper extracted papers published on serious game conception, medical education, serious gaming applications, universities experiences, and serious g...
متن کاملAn Anthropological Study of Folk Plays and Games with Focus on Fooman Town in Gilan Province
Play and Game are considered as the oldest cultural behaviors as the universal elements of human culture in all communities and groups. Gilan province in Iran, especially their villages, has a unique folklore especially its local games and plays. Nevertheless, it is necessary to document and analyze the immense information about the folklore in these villages before it vanishes in the sea of so...
متن کاملExpansion in Lifts of Graphs
The central goal of this thesis is to better understand, and explicitly construct, expanding towers G1,G2, . . ., which are expander families with the additional constraint that Gn+1 is a lift of Gn . A lift G of H is a graph that locally looks like H , but may be globally di erent; lifts have been proposed as a more structured setting for elementary explicit constructions of expanders, and the...
متن کاملLocally Testable Codes and Small-Set Expanders
The unique games conjecture has been a very influential conjecture with many striking and profound implications. Originally proposed by Khot [Kho02], a positive resolution to the conjecture, would imply that many natural and important questions can be approximated by a basic SDP algorithm (see [Rag08]) and that no algorithm can do better (unless P = NP ). Many important practical problems such ...
متن کاملComputational topology and the Unique Games Conjecture
Covering spaces of graphs have long been useful for studying expanders (as “graph lifts”) and unique games (as the “label-extended graph”). In this paper we advocate for the thesis that there is a much deeper relationship between computational topology and the Unique Games Conjecture. Our starting point is Linial’s 2005 observation that the only known problems whose inapproximability is equival...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009